package leetcode8;

public class test39 {
    /**
     * 108. 将有序数组转换为二叉搜索树
     * @param nums
     * @return
     */
    //递归方法选择左侧为根节点
    public TreeNode sortedArrayToBST(int[] nums) {
        return helper(nums,0,nums.length - 1);
    }
    public TreeNode helper(int[] nums,int left,int right){
        if(left > right)return null;
        int mid = left + (right - left) / 2;
        TreeNode root = new TreeNode(nums[mid]);
        root.left = helper(nums,left,mid - 1);
        root.right = helper(nums,mid + 1,right);
        return root;
    }
}
